Performance analysis of topology-unaware TDMA MAC schemes for ad hoc networks with topology control

نویسندگان

  • Konstantinos Oikonomou
  • Nikos B. Pronios
  • Ioannis Stavrakakis
چکیده

Traditional omni-directional antennas result in increased mutliuser interference and are known to limit the performance of Medium Access Control (MAC) protocols for ad-hoc networks. Topology control is the capability of a node to control the set of neighbor nodes and in this paper, the impact of using smart antennas and/or power control for topology control is investigated. The performance of TDMA MAC schemes with common frame for which the assignment of time slots to a node is not aware of the time slots assigned to the neighbor nodes (topology-unaware schemes like the Deterministic Policy and the Probabilistic Policy), is studied as well. A comparison based on analytical models reveals the advantages of topology control, as well as its dependence on the mobility of the nodes and its resolution. It is shown that topology control with “high resolution” in highly mobile environments may not be effective and conditions are established under which topology control is beneficial. Simulation results for a variety of network topologies support the claims and the expectations of the aforementioned analysis and show that the system throughput achieved under topology control can be higher under both policies and especially under the Probabilistic Policy. Simulation results also show how mobility affects system throughput and that topology control may not be suitable for highly mobile environments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of TDMA MAC Schemes for Ad-Hoc Networks with Topology Control

Traditional omni-directional antennas result in increased mutliuser interference and are known to limit the performance of Medium Access Control (MAC) protocols for ad-hoc networks. Topology control is the capability of a node to control the set of neighbor nodes and in this paper, the impact of using smart antennas and/or power control for topology control is investigated. The performance of T...

متن کامل

Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks

The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configuration. The existing topology-unaware TDMA-based schemes are capable of providing a minimum guaranteed throughput by considering a deterministic policy for the utilization of the assigned scheduling time slots. In an e...

متن کامل

Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks

Medium Access Control (MAC) policies in which the scheduling time slots are allocated irrespectively of the underline topology are suitable for ad-hoc networks, where nodes can enter, leave or move inside the network at any time. Topology-unaware MAC policies, that allocate slots deterministically or probabilistically have been proposed in the past and evaluated under heavy traffic assumptions....

متن کامل

A Probabilistic Topology Unaware TDMA Medium Access Control Policy for Ad Hoc Environments

The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configuration. Chlamtac and Farago have proposed a topology unaware TDMA-based scheme, suitable for ad-hoc networks, while Ju and Li have proposed an enhanced version that maximizes the minimum guaranteed throughput. Both app...

متن کامل

Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks

Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Communications

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2005